Distance-aware bloom filters: Enabling collaborative search for efficient resource discovery

نویسندگان

  • Yiming Zhang
  • Ling Liu
چکیده

Resource discovery in large-scale Peer-to-Peer (P2P) networks is challenging due to lack of effective methods for guiding queries. Based on the observation that the effectiveness of P2P resource discovery is determined by the utilization of hints, i.e., a summary of where the resources are, scattered in the network, in this paper we propose the distance-aware bloom filters (DABF) that disseminate hint information to faraway nodes by decaying BFs with different deterministic masks. Based on DABF, we design a novel Collaborative P2P Search (CPS) mechanism, which supports intelligent message behaviours including suspend, resume, terminate, move, reside, dispatch, notify and order. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations, in which we observed a remarkable reduction in search latency over previous approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi Agent Model Resource Identification in Cloud Environment by Bloom Filtration

Regarding the fact that, there are large number of resources in cloud computing system. Developing effective solutions for their queries are very important. The success of cloud computing systems fundamentally relies on the efficient use of resources. Discovering and managing resources is one important step in the system effecting. In this paper, a method of Agent-based resource discovery using...

متن کامل

Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications

The wide availability of inexpensive positioning systems made it possible to embed them into smartphones and other personal devices. This marked the beginning of location-aware applications, where users request personalized services based on their geographic position. The location of a user is, however, highly sensitive information: the user’s privacy can be preserved if only the minimum amount...

متن کامل

Bloom-Based Filters for Hierarchical Data1

In this paper, we present two novel hash-based indexing structures, based on Bloom filters, called breadth and depth Bloom filters, which in contrast to traditional hash based indexes, are able to represent hierarchical data and support path expression queries. We describe how these structures can be used for resource discovery in peer-to-peer networks. We have implemented both structures and o...

متن کامل

Bloom-Based Filters for Hierarchical Data

In this paper, we present two novel hash-based indexing structures, based on Bloom filters, called Breadth and Depth Bloom filters, which in contrast to traditional hash-based indexes, are able to summarize hierarchical data and support regular path expression queries. We describe how these structures can be used for resource discovery in peer-to-peer networks. We have implemented both structur...

متن کامل

Context Discovery Using Attenuated Bloom Filters in Ad-Hoc Networks

A novel approach to performing context discovery in ad-hoc networks based on the use of attenuated Bloom filters is proposed in this paper. A Bloom filter is an efficient spacesaving data structure to represent context information. Attenuated Bloom filters are used to advertise the availability of context information multiple hops away, and to guide queries to discover it. In order to investiga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Future Generation Comp. Syst.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2013